A new iterative approach for dominant points extraction in planar curves

In this paper the problem of dominant point detection on digital curves is addressed. Based on an initial set of curvature points, our approach adds iteratively significant points by looking for the higher curvature contour points. The process continues until all the sums of the distances of contour points in the arcs subtended to the chord between two next dominant points is less then a predefined threshold. A final refinement process adjusts the position of located dominant points by a minimum integral square error criterion. We test our method by comparing its performance with other well known dominant point extraction techniques succesfully. In the last section some examples of polygonal approximation are shown. Key–Words: Curvature, Digital Curve, Dominant Points, Polygonal Approximation.